Method of analysing extended finite-state machine specifications

نویسندگان

  • Behçet Sarikaya
  • Vassilios N. Koukoulidis
  • Gregor von Bochmann
چکیده

Formal specifications are the basis for automated verification and implementation in communication software. The paper gives a method of dynamic analysis for modular specifications which is based on symbolic execution and reachability analysis. Symbolic execution is a technique for static analysis and applied first to the specification. It is effective in detecting syntactic and semantic errors. A form of reachability analysis, called limited reachability, is used to dynamically analyse the intermodule communication. It has two applications: combining modules and detecting any errors in intermodule communication. The technique is first applied to the specifications in a nondeterministic finite-state machine model and then applied to an extended finite-state machine model for which two standard formal description languages exist.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Model Checking CoreASM Specifications

In this paper we present an approach to model checking abstract state machines using the Spin model checker. We give an algorithm for automatically transforming ASM specifications written in CoreASM [1] into Promela specifications. Though an algorithm for translating ASMs into Promela has already been presented in [2], our method supports a more powerful ASM language, including support for n-ar...

متن کامل

Automatic Synthesis of Timed Protocol Specifications from Service Specifications

Several methods have been proposed for synthesizing computer communication protocol specifications from service specifications. In real time applications, the time required to execute the events can be crucial and has to be considered. Some of the protocol synthesis methods do not consider timing constraints and, therefore, cannot be used in real time applications. In this paper, the assignment...

متن کامل

Applying infinite state model checking and other analysis techniques to tabular requirements specifications of safety-critical systems

Although it is most often applied to finite state models, in recent years, symbolic model checking has been extended to infinite state models using symbolic representations that encode infinite sets. This paper investigates the application of an infinite state symbolic model checker called Action Language Verifier (ALV) to formal requirements specifications of safety-critical systems represente...

متن کامل

Restricted cascade and wreath products of fuzzy finite switchboard state machines

A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...

متن کامل

Testing a System specified using Statecharts and Z 1

A hybrid specification language μSZ, in which the dynamic behaviour of a system is described using Statecharts and the data and the data transformations are described using Z, has been developed for the specification of embedded systems. This paper describes an approach to testing from a deterministic sequential specification written in μSZ. By considering the Z specifications of the operations...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computer Communications

دوره 13  شماره 

صفحات  -

تاریخ انتشار 1990